START Project Y43-MAT Combinatorial Approximation Algorithms TU Graz, Austria
نویسندگان
چکیده
We consider the scheduling problems F2 j jCmax and F2 j no-wait jCmax, i.e. makespan minimization in a two machine ow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n logn) running time are known, where n denotes the number of jobs [Johnson 1954, Gilmore & Gomory 1964]. We prove that no asymptotically faster algorithms can solve these problems. This is done by establishing (n logn) lower bounds in the algebraic computation tree model of computation. Moreover, we develop for every " > 0 approximation algorithms with linear running time O(n log 1 " ) that deliver feasible schedules whose makespan is at most 1 + " times the optimum makespan.
منابع مشابه
Start Project Y43-mat Combinatorial Approximation Algorithms Time Complexity and Linear-time Approximation of the Ancient Two Machine Flow Shop Time Complexity and Linear-time Approximation of the Ancient Two Machine Ow Shop
We consider the scheduling problems F 2 j j C max and F 2 j no-wait j C max , i.e. makespan minimization in a two machine ow shop, with and without no wait in process. For both problems solution algorithms based on sorting with O(n log n) running time are known, where n denotes the number of jobs Johnson 1954, Gilmore & Gomory 1964]. We prove that no asymptotically faster algorithms can solve t...
متن کاملStart Project Y43-mat Combinatorial Approximation Algorithms Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup times Minimizing the Number of Tardy Jobs on a Single Machine with Batch Setup Times
This paper investigates a single-machine sequencing problem where the jobs are divided into families, and where a setup time is incurred whenever there is a switch from a job in one family to a job in another family. This setup only depends on the family of the job next to come and hence is sequence independent. The jobs are due-dated, and the objective is to nd a sequence of jobs that minimize...
متن کاملBoundary Element Analysis with trimmed NURBS and a generalized IGA approach
Gernot Beer, Benjamin Marussig, Jürgen Zechner , Christian Dünser and Thomas-Peter Fries 1 Emeritus professor , TU Graz, Lessingstrasse 25, Graz, Austria and conjoint professor Centre for Geotechnical and Materials Modeling, University of Newcastle, Callaghan, Australia, [email protected] 2 PhD Student, TU Graz , Lessingstrasse 25, Graz, Austria [email protected] 3 Postdoc, TU Graz , Lessi...
متن کاملLower dimensional Yang-Mills theory as a laboratory to study the infrared regime
Reinhard Alkofer Institut für Physik, Karl-Franzens-Universität, Universitätsplatz 5, A-8010 Graz, Austria Christian S. Fischer Institut für Physik, TU Darmstadt, Schlossgartenstr. 9, D-64289 Darmstadt, Germany Markus Q. Huber Institut für Physik, Karl-Franzens-Universität, Universitätsplatz 5, A-8010 Graz, Austria Kai Schwenzer Institut für Physik, Karl-Franzens-Universität, Universitätsplatz ...
متن کاملFetal Rhabdomyoma of the upper Extremity in a 31- Year Old Patient: a Case Report
Fetal rhabdomyomas (RM) are extremely rare benign mesenchymal tumours that occur primarily in the head and neck.This tumour exhibits immature skeletal muscle differentiation. The patients’ median age is four years and surgical resectionis the recommended treatment.Fetal RM of limbs are rare and not well described in the literature and if, predominantly in form of case reports. We reportthe seco...
متن کامل